全文获取类型
收费全文 | 11111篇 |
免费 | 830篇 |
国内免费 | 397篇 |
专业分类
化学 | 1288篇 |
晶体学 | 32篇 |
力学 | 1171篇 |
综合类 | 168篇 |
数学 | 8157篇 |
物理学 | 1522篇 |
出版年
2024年 | 16篇 |
2023年 | 111篇 |
2022年 | 208篇 |
2021年 | 348篇 |
2020年 | 216篇 |
2019年 | 251篇 |
2018年 | 264篇 |
2017年 | 350篇 |
2016年 | 344篇 |
2015年 | 250篇 |
2014年 | 506篇 |
2013年 | 678篇 |
2012年 | 660篇 |
2011年 | 517篇 |
2010年 | 493篇 |
2009年 | 628篇 |
2008年 | 615篇 |
2007年 | 686篇 |
2006年 | 557篇 |
2005年 | 500篇 |
2004年 | 407篇 |
2003年 | 383篇 |
2002年 | 383篇 |
2001年 | 314篇 |
2000年 | 323篇 |
1999年 | 256篇 |
1998年 | 270篇 |
1997年 | 237篇 |
1996年 | 161篇 |
1995年 | 191篇 |
1994年 | 159篇 |
1993年 | 137篇 |
1992年 | 123篇 |
1991年 | 108篇 |
1990年 | 95篇 |
1989年 | 82篇 |
1988年 | 57篇 |
1987年 | 48篇 |
1986年 | 55篇 |
1985年 | 59篇 |
1984年 | 61篇 |
1983年 | 19篇 |
1982年 | 28篇 |
1981年 | 27篇 |
1980年 | 20篇 |
1979年 | 37篇 |
1978年 | 23篇 |
1977年 | 34篇 |
1976年 | 20篇 |
1974年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 812 毫秒
91.
In this paper,we consider a class of quadratic maximization problems.For a subclass of the problems,we show that the SDP relaxation approach yields an approximation solution with the ratio is dependent on the data of the problem with α being a uniform lower bound.In light of this new bound,we show that the actual worst-case performance ratio of the SDP relaxation approach (with the triangle inequalities added) is at least α δd if every weight is strictly positive,where δd > 0 is a constant depending on the problem dimension and data. 相似文献
92.
C. Bogani M. G. Gasparo A. Papini 《Journal of Optimization Theory and Applications》2007,134(1):47-59
We propose a pattern search method to solve a classical nonsmooth optimization problem. In a deep analogy with pattern search
methods for linear constrained optimization, the set of search directions at each iteration is defined in such a way that
it conforms to the local geometry of the set of points of nondifferentiability near the current iterate. This is crucial to
ensure convergence. The approach presented here can be extended to wider classes of nonsmooth optimization problems. Numerical
experiments seem to be encouraging.
This work was supported by M.U.R.S.T., Rome, Italy. 相似文献
93.
Adam B. Levy 《Mathematical Programming》2007,110(3):615-639
Numerical methods for solving constrained optimization problems need to incorporate the constraints in a manner that satisfies
essentially competing interests; the incorporation needs to be simple enough that the solution method is tractable, yet complex
enough to ensure the validity of the ultimate solution. We introduce a framework for constraint incorporation that identifies
a minimal acceptable level of complexity and defines two basic types of constraint incorporation which (with combinations)
cover nearly all popular numerical methods for constrained optimization, including trust region methods, penalty methods,
barrier methods, penalty-multiplier methods, and sequential quadratic programming methods. The broad application of our framework
relies on addition and chain rules for constraint incorporation which we develop here. 相似文献
94.
在本文中引入了泛代数的二次扩张的概念,解决了TU-EC(A)和UT-EC(A)的存在、真类和基数问题,范畴TU-EC(A)(及UT-EC(A)),并得到了有关二次扩张的几个同构定理,还对一点二次扩张作了讨论。 相似文献
95.
Protein Conformation of a Lattice Model Using Tabu Search 总被引:1,自引:0,他引:1
We apply tabu search techniques to the problem of determining the optimal configuration of a chain of protein sequences on a cubic lattice. The problem under study is difficult to solve because of the large number of possible conformations and enormous amount of computations required. Tabu search is an iterative heuristic procedure which has been shown to be a remarkably effective method for solving combinatorial optimization problems. In this paper, an algorithm is designed for the cubic lattice model using tabu search. The algorithm has been tested on a chain of 27 monomers. Computational results show that our method outperforms previously reported approaches for the same model. 相似文献
96.
A parallel inexact Newton method with a line search is proposed for two-stage quadratic stochastic programs with recourse. A lattice rule is used for the numerical evaluation of multi-dimensional integrals, and a parallel iterative method is used to solve the quadratic programming subproblems. Although the objective only has a locally Lipschitz gradient, global convergence and local superlinear convergence of the method are established. Furthermore, the method provides an error estimate which does not require much extra computation. The performance of the method is illustrated on a CM5 parallel computer.This work was supported by the Australian Research Council and the numerical experiments were done on the Sydney Regional Centre for Parallel Computing CM5. 相似文献
97.
聚醚醚酮链结构与反应的模型化合物的量子化学研究 总被引:1,自引:1,他引:0
利用AM1方法对聚醚醚酮模型化合物全优化,结果为:芳环平均相互扭转角为33.0度,桥键角117.0-118.0度,其分子结构拓扑图形表明:所有苯环(核)为平面构型,但其内角扭曲;其氢原子对苯环构型无实质性贡献,在更长链的计算中,冻结苯核与氢原子也得出满意结果,根据Mulliken键序与电荷讨论了醚交换与磺化反应。 相似文献
98.
1989年发表的Bager第五图,包含关于三角形元素的35个二次规范画数之间的51个不等式通过细致的分析,本文给出了其中遗漏的12个基本不等式 相似文献
99.
Youssef Saab 《Journal of Heuristics》1997,3(3):207-224
A heuristic optimization methodology, Dynamic Contraction (DC), is introduced as an approach for solving a wide variety of hard combinatorial problems. Contraction is an operation that maps an instance of a problem to a smaller instance of the same problem. DC is an iterative improvement strategy that relies on contraction as a mechanism for escaping local minima. As a byproduct of contraction, efficiency is improved due to a reduction of problem size. Effectiveness of DC is shown through simple applications to two classical combinatorial problems: The graph bisection problem and the traveling salesman problem. 相似文献
100.
A BRANCH BOUND METHOD FOR SUBSET SUM PROBLEM 总被引:1,自引:0,他引:1
吴士泉 《应用数学学报(英文版)》1994,10(3):302-314
ABRANCHBOUNDMETHODFORSUBSETSUMPROBLEMWUSHIQUAN(吴士泉)(InstituteofAppliedMathematics,theChineseAcademyofSciences,Beijing100080,C... 相似文献